Syntactic Regions for Concurrent Programs
نویسندگان
چکیده
In order to gain a better understanding of the state space programs, with aim making their verification more tractable, models based on directed topological spaces have been introduced, allowing take in account equivalence between execution traces, as well translate features (such presence deadlocks) into geometrical situations. this context, many algorithms were description regions consisting unions rectangles. We explain here that these constructions can actually be performed directly syntax thus resulting representations which are natural and easier implement. do so, we start from observation positions program described partial explorations program. The operational semantics induces positions, defined formal intervals poset. then study structure such show that, under reasonable conditions, they form boolean algebra admit representation normal (which corresponds covering by maximal intervals), supporting needed for purpose studying programs. All operations involved given explicit algorithmic descriptions.
منابع مشابه
Automatically finding atomic regions for fixing bugs in Concurrent programs
This paper presents a technique for automatically constructing a fix for buggy concurrent programs: given a concurrent program that does not satisfy user-provided assertions, we infer atomic blocks that fix the program. An atomic block protects a piece of code and ensures that it runs without interruption from other threads. Our technique uses a verification tool as a subroutine to find the sma...
متن کاملNoninterference for Concurrent Programs
We propose a type system to ensure the property of noninterference in a system of concurrent programs, described in a standard imperative language extended with parallelism. Our proposal is in the line of some recent work by Irvine, Volpano and Smith. Our type system, as well as our semantics for concurrent programs, seem more natural and less restrictive than those originally presented by thes...
متن کاملType Systems for Concurrent Programs
Type systems for programming languages help reasoning about program behavior and early nding of bugs. Recent applications of type systems include analysis of various program behaviors such as side effects, resource usage, security properties, and concurrency. This paper is a tutorial of one of such applications: type systems for analyzing behavior of concurrent processes. We start with a simple...
متن کاملVerifying Optimizations for Concurrent Programs
While program correctness for compiled languages depends fundamentally on compiler correctness, compiler optimizations are not usually formally verified due to the effort involved, particularly in the presence of concurrency. In this paper, we present a framework for stating and reasoning about compiler optimizations and transformations on programs in the presence of relaxed memory models. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic proceedings in theoretical computer science
سال: 2021
ISSN: ['2075-2180']
DOI: https://doi.org/10.4204/eptcs.351.12